Improved moth flame optimization algorithm based on opposition-based learning and Lévy flight distribution for parameter estimation of solar module

نویسندگان

چکیده

An enhanced version of the moth flame optimization algorithm is proposed in this paper for rapid and precise parameter extraction solar cells. The OBLVMFO algorithm’s novelty lies primarily improved search strategies, where two modifications are to maintain a proper balance between exploration exploitation. Firstly, an opposition-based learning mechanism employed initialize population purpose enhancing global search. Secondly, Lévy flight distribution used prevent stagnation solutions local minima. implementation intelligent rules such as OBL significantly improves performance standard MFO. developed performed adequately reliable terms RMSE compared other methodologies MFO, ALO, SCA, MRFO, WOA. best optimized value achieved by 6.060E−04, 1.3600E−05, 7.0001E−06 STE 4/100 (polycrystalline), LSM 20 (monocrystalline), SS2018P (polycrystalline) PV modules, respectively. experiments on benchmark test function revealed that has 61% faster convergence speed than which solution accuracy. In addition this, non-parametric tests: Friedman ranking Wilcoxon rank sum validation.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

STATIC AND DYNAMIC OPPOSITION-BASED LEARNING FOR COLLIDING BODIES OPTIMIZATION

Opposition-based learning was first introduced as a solution for machine learning; however, it is being extended to other artificial intelligence and soft computing fields including meta-heuristic optimization. It not only utilizes an estimate of a solution but also enters its counter-part information into the search process. The present work applies such an approach to Colliding Bodies Optimiz...

متن کامل

An improved opposition-based Crow Search Algorithm for Data Clustering

Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...

متن کامل

An Improved Cat Swarm Optimization Algorithm Based on Opposition-Based Learning and Cauchy Operator for Clustering

Clustering is a NP-hard problem that is used to find the relationship between patterns in a given set of patterns. It is an unsupervised technique that is applied to obtain the optimal cluster centers, especially in partitioned based clustering algorithms. On the other hand, cat swarm optimization (CSO) is a new metaheuristic algorithm that has been applied to solve various optimization problem...

متن کامل

Elite Opposition-based Artificial Bee Colony Algorithm for Global Optimization

 Numerous problems in engineering and science can be converted into optimization problems. Artificial bee colony (ABC) algorithm is a newly developed stochastic optimization algorithm and has been widely used in many areas. However, due to the stochastic characteristics of its solution search equation, the traditional ABC algorithm often suffers from poor exploitation. Aiming at this weakness o...

متن کامل

application of upfc based on svpwm for power quality improvement

در سالهای اخیر،اختلالات کیفیت توان مهمترین موضوع می باشد که محققان زیادی را برای پیدا کردن راه حلی برای حل آن علاقه مند ساخته است.امروزه کیفیت توان در سیستم قدرت برای مراکز صنعتی،تجاری وکاربردهای بیمارستانی مسئله مهمی می باشد.مشکل ولتاژمثل شرایط افت ولتاژواضافه جریان ناشی از اتصال کوتاه مدار یا وقوع خطا در سیستم بیشتر مورد توجه می باشد. برای مطالعه افت ولتاژ واضافه جریان،محققان زیادی کار کرده ...

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Energy Reports

سال: 2022

ISSN: ['2352-4847']

DOI: https://doi.org/10.1016/j.egyr.2022.05.011